A Precise Execution Semantics for BPMN
نویسنده
چکیده
Bringing a high confidence to the validity of business processes is one of the prevailing themes in business process management. Regardless of the introduction of BPMN 1.2, there is no discernible improvement in the preciseness of the BPMN semantics. Motivated by the need to ensure the trustworthiness of BPMN models and the absence of an accurate behavioural semantics, a rigorous semantic definition of BPMN is advocated. The symbolic encodings of the execution semantics are expressed concisely using linear temporal logic (LTL). The LTL-based representations serve as a basis for the formal analysis of BPMN diagrams as well as the prototypical implementation of software tools.
منابع مشابه
BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules: extended version
The Business Process Model and Notation (BPMN) standard version 2.0 informally defines a precise execution semantics. This paper defines that execution semantics formally, by defining the execution rules as graph rewrite rules. The paper shows that the formal definition of execution rules in this manner is intuitive and simple, in particular because they can be specified graphically, using the ...
متن کاملBPMN Core Modeling Concepts: Inheritance-Based Execution Semantics
We define an abstract model for the dynamic semantics of the core process modeling concepts in the OMG standard for BPMN 2.0. The UML class diagrams associated therein with each flow element are extended with a rigorous behavior definition, which reflects the inheritance hierarchy structure by refinement steps. The correctness of the resulting precise algorithmic model for an execution semantic...
متن کاملA visual token-based formalization of BPMN 2.0 based on in-place transformations
Context The Business Process Model and Notation (BPMN) standard informally defines a precise execution semantics. It defines how process instances should be updated in a model during execution. Existing formalizations of the standard are incomplete and rely on mappings to other languages. Objective This paper provides a BPMN 2.0 semantics formalization that is more complete and intuitive than e...
متن کاملBPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules
This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informal...
متن کاملFormal Semantics and Automated Analysis of BPMN Process Models
The Business Process Modelling Notation (BPMN) is a standard for capturing business processes in the early phases of systems development. The mix of constructs found in BPMN makes it possible to obtain models with a range of semantic errors. The ability to statically check the semantic correctness of models is thus a desirable feature for modelling tools based on BPMN. However, the static analy...
متن کامل